Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
نویسندگان
چکیده
We show how to construct efficient, unconditionally secure non-malleable codes for bounded output locality. In particular, our scheme is resilient against functions such that any output bit is dependent on at most n bits, where n is the total number of bits in a codeword and 0 ≤ δ < 1 a constant. Notably, this tampering class includes NC .
منابع مشابه
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering
We show a general framework for constructing non-malleable codes against tampering families with average-case hardness bounds. Our framework adapts ideas from the Naor-Yung double encryption paradigm such that to protect against tampering in a class F , it suffices to have average-case hard distributions for the class, and underlying primitives (encryption and non-interactive, simulatable proof...
متن کاملNon-Malleable Codes from Average-Case Hardness: AC, Decision Trees, and Streaming Space-Bounded Tampering
We show a general framework for constructing non-malleable codes against tampering families with average-case hardness bounds. Our framework adapts ideas from the Naor-Yung double encryption paradigm such that to protect against tampering in a class F , it suffices to have average-case hard distributions for the class, and underlying primitives (encryption and non-interactive, simulatable proof...
متن کاملSuperpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits
In this paper, we prove superpolynomial lower bounds for the class of homogeneous depth 4 arithmetic circuits. We give an explicit polynomial in VNP of degree n in n variables such that any homogeneous depth 4 arithmetic circuit computing it must have size n . Our results extend the works of Nisan-Wigderson [NW95] (which showed superpolynomial lower bounds for homogeneous depth 3 circuits), Gup...
متن کاملLocally Decodable and Updatable Non-Malleable Codes in the Bounded Retrieval Model
In a recent result, Dachman-Soled et al. (TCC ’15) proposed a new notion called locally decodable and updatable non-malleable codes, which informally, provides the security guarantees of a non-malleable code while also allowing for efficient random access. They also considered locally decodable and updatable non-malleable codes that are leakage-resilient, allowing for adversaries who continuall...
متن کاملValiant’s Polynomial-Size Monotone Formula for Majority
The existence of polynomial-size (monotone) formulae is known to be equivalent to the existence of logarithmic-depth (monotone) circuits of bounded fan-in. Anyhow, we shall prove the existence of logarithmic-depth monotone formulae (of bounded fan-in) for majority. Actually, two radically different proofs are known: The first proof uses a rather complicated construction of sorting networks of l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2016 شماره
صفحات -
تاریخ انتشار 2016